Semidefinite and Second Order Cone Programming Seminar Fall 2012 Lecture 10 Instructor : Farid Alizadeh Scribe

نویسندگان

  • Farid Alizadeh
  • Joonhee Lee
چکیده

1 Overview In this lecture, we show that a number of sets and functions related to the notion of sum-of-squares (SOS) are SD-representable. We will start with positive polynomials. Then, we introduce a general algebraic framework in which the notion of sum-of-squares can be formulated in very general setting. Recall the cone of nonnegative univariate polynomials: P 2d [t] = p(t) = p 0 + p 1 t + p 2 t 2 + · · · + p 2d t 2d 0 ∀t ∈ R Earlier we have examined this cone and have shown that it is SD-representable. We now consider the case of multivariate polynomials. The set of nonnegative polynomials is Recall that in the case of univariate polynomials, a polynomial p(t) 0 for all t ∈ R if and only if there are two polynomials p 1 (t), p 2 (t) such that p(t) = p 2 1 (t) + p 2 2 (t). In other words, a univariate polynomial is nonnegative over the real line if and only if it is a sum of squares. For multivariate polynomials this is no longer true.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Lecture 2

1 Overview We had a general overview of semidefinite programming(SDP) in lecture 1, starting from this lecture we will be jumping into the theory. Some topics we will discuss in the next few lectures include: the duality theory, notion of complementary slackness, at least one polynomial time algorithm of solving SDP and application in integer programming and combinatorial optimization. Througho...

متن کامل

Semidefinite and Second Order Cone Programming Seminar Fall 2012

The dissertation by Maryam Fazel, “Matrix Rank Minimization with applications”, [3], focuses on minimizing ranks over matrices of convex sets which is genrally an NP-hard problem. The work provides a new heuristics for solving Rank Minimization Problem (RMP) for PSD matrices, which contrary to hitherto developed heuristics, do not require an initial point, are numerically efficient and provide ...

متن کامل

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project Report Shape Constraints And Its Application

In this project, I will introduce a method to estimate the function by cubic splines. As an example, I will focus on the non-homogeneous Poisson process. Since this method uses an optimization model based on the maximum likelihood principle, it may applied to other stochastic processes. The most critical point of this presentation is a nonnegativity constriant on the splines. In addition, choos...

متن کامل

Semidefinite and Second Order Cone Programming

1 Overview We survey the basic notions of cones and cone-LP and give several examples mostly related to semidefinite programming. The linear and semidefinite programming problems are formulated as follows: Let c ∈ n and b ∈ m ,A ∈ n×m with rows a i ∈

متن کامل

Semidefinite and Second Order Cone Programming Seminar

Image is represented by an undirected weighted graph G = (V, E) where vertices i ∈ V = {1, . . . , n} correspond to image features, and edges (i, j) ∈ E have weights w(i, j) : V × V 7→ R that reflect pairwise similarity between features. To segment an image, we wish to partition nodes V into two disjoint coherent sets S and S̄ = V \ S. This means that edges within the same set should have high w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013